Space Complexity and Word Problems of Groups
نویسندگان
چکیده
In this section we will give an overview of the paper; precise definitions of the terms used here will be found in Sections 2, 3 and 4. Our starting point is that there are several intriguing links between group theory and formal language theory. One of the many interesting such connections is the consideration of which groups G have a word problem lying in a particular class F of formal languages, and this will be the main theme of this paper; see [7, 8, 10, 23] (for example) for a survey of some of these issues.
منابع مشابه
The characteristics of mathematical word problems at the middle school and suggested strategies to facilitae their solution process
Abstract: This paper, first it has reviewed the literature on the characteristics of mathematical word problems and their solution process. The review revealed that among the root causes for students’ difficulties with mathematical word problems, two factors are salient, namely the text complexity and the unfamiliar context. To shed more light on these findings, a factorial experimental study w...
متن کاملThe bounded and precise word problems for presentations of groups
We introduce and study the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be solved in nondeterministic polynomial time, and the precise word problem is in PSPACE. The main technical result of the paper states that, for certain finit...
متن کاملLogspace and compressed-word computations in nilpotent groups
For finitely generated nilpotent groups, we employ Mal’cev coordinates to solve several classical algorithmic problems efficiently. Computation of normal forms, the membership problem, the conjugacy problem, and computation of presentations for subgroups are solved using only logarithmic space and, simultaneously, in quasilinear time. Compressed-word versions of these problems, in which each in...
متن کاملSelf-, Peer-, and Teacher-Assessments in Writing Improvement: A Study of Complexity, Accuracy, and Fluency
Alternative assessment approaches and, among them, self-assessment and peer-assessment are becoming increasingly important in educational contexts. Designed to compare self-assessment, peer-assessment, and teacher-assessment, this study included 90 EFL students from 3 intact classes divided into 3 groups: self-assessment, peer-assessment, and teacher-assessment. After taking the TOEFL Proficien...
متن کامل, 57 M 05 Average - Case Complexity and Decision Problems in Group Theory
We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on " generic-case complexity " we show that if a finitely generated group G has the word problem solv-able in subexponential time and has a subgroup of finite index which possesses a non-elementary word-hyperbolic quotient group,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Groups Complexity Cryptology
دوره 1 شماره
صفحات -
تاریخ انتشار 2009